pub fn odd_fibnacci_sum(threshold: u32) -> u32 {
    // TODO: 这里写逻辑
    let mut sum = 0;
    let (mut a, mut b) = (0, 1); // 初始化斐波那契序列的前两项

    while b < threshold {
        if b % 2 != 0 {
            sum += b; // 如果当前斐波那契数是奇数，累加到 sum
        }
        let temp = a + b;
        a = b;
        b = temp;
    }

    sum
}
